https://ogma.newcastle.edu.au/vital/access/ /manager/Index ${session.getAttribute("locale")} 5 Incremental network design with maximum flows https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:26872 Wed 04 Sep 2019 10:37:58 AEST ]]> Scheduling reclaimers serving a stock pad at a coal terminal https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:33276 Wed 04 Sep 2019 09:55:27 AEST ]]> Incremental network design with minimum spanning trees https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:31033 G=(V,E) and a set E0⊂E, the incremental network design problem with minimum spanning trees asks for a sequence of edges e′1,…,e′T∈E∖E0 minimizing [formula could not be replicated] where w(Xt) is the weight of a minimum spanning tree Xt for the subgraph (V,E0∪{e′1,…,e′t}) and T=|E∖E0|. We prove that this problem can be solved by a greedy algorithm.]]> Wed 04 Sep 2019 09:39:31 AEST ]]> Multiportfolio optimization: a natural next step https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12649 Sat 24 Mar 2018 08:17:55 AEDT ]]> Vendor managed inventory for environments with stochastic product usage https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12645 Sat 24 Mar 2018 08:17:43 AEDT ]]> Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12554 Sat 24 Mar 2018 08:17:33 AEDT ]]> A branch-price-and-cut algorithm for single-product maritime inventory routing https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12538 Sat 24 Mar 2018 08:17:30 AEDT ]]> The supplier selection problem with quantity discounts and truckload shipping https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12537 Sat 24 Mar 2018 08:17:30 AEDT ]]> A hybrid solution approach for ready-mixed concrete delivery https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12595 Sat 24 Mar 2018 08:17:29 AEDT ]]> Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12603 Sat 24 Mar 2018 08:17:28 AEDT ]]> Tactical and operational planning of scheduled maintenance for per-seat, on-demand air transportation https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12604 Sat 24 Mar 2018 08:17:28 AEDT ]]> Branch-and-price guided search for integer programs with an application to the multicommodity fixed-charge network flow problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12829 Sat 24 Mar 2018 08:17:16 AEDT ]]> Fixed-charge transportation with product blending https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12542 Sat 24 Mar 2018 08:17:05 AEDT ]]> Creating schedules and computing costs for LTL load plans https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12544 Sat 24 Mar 2018 08:17:04 AEDT ]]> The fixed-charge shortest-path problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12543 e for using arc e, an interval [le, ue] (le, ue ∈ ℤ) specifying the range of allowable resource consumption quantities along arc e, and a per-unit cost ce for resource consumed along e. Furthermore, for each node n ∈ N, let Un ∈ ℤ be the maximum amount of resource consumption a path can accumulate before visiting node n. Given a source node ns ∈ N and sink node nt ∈ N, the fixed-charge shortest-path problem (FCSPP) seeks to find a minimum-cost-feasible path from ns to nt . When resource consumption is simply additive, the resource-constrained shortest-path problem (RCSPP) is a special case of FCSPP. We develop a new dynamic programming algorithm for FCSPP. The algorithm uses solutions from labeling and dominance techniques for standard RCSPPs on slightly modified problems, and it combines these solutions by exploiting the structure provided by certain classes of knapsack problems to efficiently construct an optimal solution to FCSPP. Computational experiments demonstrate that our algorithm is often several orders of magnitude faster than naive dynamic programming procedures.]]> Sat 24 Mar 2018 08:17:04 AEDT ]]> Delivery strategies for blood products supplies https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12617 Sat 24 Mar 2018 08:15:29 AEDT ]]> Information-based branching schemes for binary linear mixed integer problems https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12619 Sat 24 Mar 2018 08:15:29 AEDT ]]> Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12840 Sat 24 Mar 2018 08:15:24 AEDT ]]> Optimizing the Hunter Valley coal chain https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12717 Sat 24 Mar 2018 08:15:19 AEDT ]]> Dynamic ride-sharing: a simulation study in metro Atlanta https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:12615 Sat 24 Mar 2018 08:14:44 AEDT ]]> A pickup and delivery problem using crossdocks and truckload lane rates https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:21698 Sat 24 Mar 2018 08:06:26 AEDT ]]> Local search for a cargo assembly planning problem https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:20828 Sat 24 Mar 2018 08:05:54 AEDT ]]> Incremental network design with shortest paths https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19239 Sat 24 Mar 2018 07:54:56 AEDT ]]> Creating schedules and computing operating costs for LTL load plans https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:19401 Sat 24 Mar 2018 07:52:07 AEDT ]]> A note on shortest path problems with forbidden paths https://ogma.newcastle.edu.au/vital/access/ /manager/Repository/uon:18496 Sat 24 Mar 2018 07:51:22 AEDT ]]>